Calculating correct compilers
نویسندگان
چکیده
منابع مشابه
Calculating correct compilers
In this article we present a new approach to the problem of calculating compilers. In particular, we develop a simple but general technique that allows us to derive correct compilers from highlevel semantics by systematic calculation, with all details of the implementation of the compilers falling naturally out of the calculation process. Our approach is based upon the use of standard equationa...
متن کاملAutomatic Generation of Provably Correct Parallelizing Compilers
We show how parallelizing compilers can be automatically derived from denotational deenitions of programming languages. In our approach, the denotational deenition is expressed using deenite clause grammars (syntax speciication) and Horn Logic or Constraint Logic (semantic speciication). The conditions for executing two or more statements in parallel (e.g., GCD test, Banerjee test, or exact tes...
متن کاملCalculating Certified Compilers for Non-deterministic Languages
Reasoning about programming languages with non-deterministic semantics entails many difficulties. For instance, to prove correctness of a compiler for such a language, one typically has to split the correctness property into a soundness and a completeness part, and then prove these two parts separately. In this paper, we present a set of proof rules to prove compiler correctness by a single pro...
متن کاملVerification Tools in the Development of Provably Correct Compilers
The paper presents a practical veriication tool that helps in the development of provably correct compilers. The tool is based on the approach of proving termination of PROLOG-like programs using term-rewriting techniques and a technique of testing whether a given PROLOG program can be soundly executed on PROLOG interpreters without the Occur-check test. The tool has been built on top of the th...
متن کاملShading Compilers
Graphics hardware evolution in the past year has been highlighted by improved shading resources, the introduction of dynamic flow control and the emergence of multi-GPU system configurations. Executed program length increased substantially and register availability became more affordable. As a result, compiler support for segmenting a shading program to fit hardware constraints has diminished a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Programming
سال: 2015
ISSN: 0956-7968,1469-7653
DOI: 10.1017/s0956796815000180